False-twin-free graphs with a fixed number of negative eigenvalues
نویسندگان
چکیده
We prove a quantitative version of result Torgašev concerning graphs with fixed number negative eigenvalues. also establish structural stating that if for hereditary family every graph order N+1 and N+2 has false twins, then from this greater than N twins.
منابع مشابه
Small graphs with exactly two non-negative eigenvalues
Let $G$ be a graph with eigenvalues $lambda_1(G)geqcdotsgeqlambda_n(G)$. In this paper we find all simple graphs $G$ such that $G$ has at most twelve vertices and $G$ has exactly two non-negative eigenvalues. In other words we find all graphs $G$ on $n$ vertices such that $nleq12$ and $lambda_1(G)geq0$, $lambda_2(G)geq0$ and $lambda_3(G)0$, $lambda_2(G)>0$ and $lambda_3(G)
متن کاملOn the fixed number of graphs
A set of vertices $S$ of a graph $G$ is called a fixing set of $G$, if only the trivial automorphism of $G$ fixes every vertex in $S$. The fixing number of a graph is the smallest cardinality of a fixing set. The fixed number of a graph $G$ is the minimum $k$, such that every $k$-set of vertices of $G$ is a fixing set of $G$. A graph $G$ is called a $k$-fixed graph, if its fix...
متن کاملTight lower bounds on the number of bicliques in false-twin-free graphs
A biclique is a maximal bipartite complete induced subgraph of G. Bicliques have been studied in the last years motivated by the large number of applications. In particular, enumeration of the maximal bicliques has been of interest in data analysis. Associated with this issue, bounds on the maximum number of bicliques were given. In this paper we study bounds on the minimun number of bicliques ...
متن کاملEigenvalues of some signed graphs with negative cliques
In a signed graph G, a negative clique is a complete subgraph having negative edges only. In this article, we give characteristic polynomial expressions, and eigenvalues of some signed graphs having negative cliques. This includes signed cycle graph, signed path graph, a complete graph with disjoint negative cliques, and star block graph with negative cliques.
متن کاملSemiharmonic graphs with fixed cyclomatic number
Let the trunk of a graph G be the graph obtained by removing all leaves of G. We prove that, for every integer c ≥ 2, there are at most finitely many trunks of semiharmonic graphs with cyclomatic number c — in contrast to the fact established by the last two of the present authors in their paper Semiharmonic Bicyclic Graphs (this journal) that there are infinitely many connected semiharmonic gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2021
ISSN: ['1873-1856', '0024-3795']
DOI: https://doi.org/10.1016/j.laa.2021.02.004